Real Quantifier Elimination in the RegularChains Library
نویسندگان
چکیده
Quantifier elimination (QE) over real closed fields has found numerous applications. Cylindrical algebraic decomposition (CAD) is one of the main tools for handling quantifier elimination of nonlinear input formulas. Despite of its worst case doubly exponential complexity, CAD-based quantifier elimination remains interesting for handling general quantified formulas and producing simple quantifier-free formulas. In this paper, we report on the implementation of a QE procedure, called QuantifierElimination, based on the CAD implementations in the RegularChains library. This command supports both standard quantifier-free formula and extended Tarski formula in the output. The use of the QE procedure is illustrated by solving examples from different applications.
منابع مشابه
Using the Regular Chains Library to Build Cylindrical Algebraic Decompositions by Projecting and Lifting
Cylindrical algebraic decomposition (CAD) is an important tool, both for quantifier elimination over the reals and a range of other applications. Traditionally, a CAD is built through a process of projection and lifting to move the problem within Euclidean spaces of changing dimension. Recently, an alternative approach which first decomposes complex space using triangular decomposition before r...
متن کاملCylindrical Algebraic Decomposition in the RegularChains Library
Cylindrical algebraic decomposition (CAD) is a fundamental tool in computational real algebraic geometry and has been implemented in several software. While existing implementations are all based on Collins’ projection-lifting scheme and its subsequent ameliorations, the implementation of CAD in the RegularChains library is based on triangular decomposition of polynomial systems and real root i...
متن کاملUsing Maple's RegularChains Library to Automatically Classify Plane Geometric Loci
We report a preliminary discussion on the usability of the RegularChains library of Maple for the automatic computation of plane geometric loci and envelopes in graphical interactive environments. We describe a simple implementation of a recently proposed taxonomy of algebraic loci, and its extension to envelopes of families of curves is also discussed. Furthermore, we sketch how currently unso...
متن کاملMetaFork: a compilation framework for concurrency models targeting hardware accelerators and its application to the generation of parametric CUDA kernels
In this paper, we present the accelerator model of MetaFork together with the software framework that allows automatic generation of CUDA code from annotated MetaFork programs. One of the key features of this CUDA code generator is that it supports the generation of CUDA kernel code where program parameters (like number of threads per block) and machine parameters (like shared memory size) are ...
متن کاملA note on real quantifier elimination by virtual term substitution of unbounded degree
We describe work in progress on constructing a complete implementation of Weispfenning’s virtual term substitution method for real closed field formulas of unbounded degree. We build upon a recent high-performance library for computing over non-Archimedean real closed fields using Thom’s Lemma.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014